Sequence motif finder using memetic algorithm

نویسندگان
چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

The NestedMICA motif finder

NestedMICA is a new, scalable, pattern-discovery system, aimed at finding transcription factor binding sites and similar motifs in biological sequence. More discussion of the principles behind NestedMICA, and an evaluation of its sensitivity can be found in a recent paper [1]. If you have any problems or questions about the system, please contact Thomas Down.

متن کامل

QPS -- quadratic programming sampler, a motif finder using biophysical modeling

We present a Markov chain Monte Carlo algorithm for local alignments of nucleotide sequences aiming to infer putative transcription factor binding sites, referred to as the quadratic programming sampler. The new motif finder incorporates detailed biophysical modeling of the transcription factor binding site recognition which arises an intrinsic threshold discriminating putative binding sites fr...

متن کامل

Biological sequence motif discovery using motif-x.

The Web-based motif-x program provides a simple interface to extract statistically significant motifs from large data sets, such as MS/MS post-translational modification data and groups of proteins that share a common biological function. Users upload data files and download results using common Web browsers on essentially any Web-compatible computer. Once submitted, data analyses are performed...

متن کامل

Application of memetic algorithm in assembly sequence planning

Assembly sequence planning (ASP) plays an important role in the product design and manufacturing. A good assembly sequence can help to reduce the cost and time of the manufacturing process. However, ASP is known as a classical hard combinatorial optimization problem. With the increasing of the quantity of product components, ASP becomes more difficult and the traditional graph-based algorithm c...

متن کامل

Breaking A Playfair Cipher Using Memetic Algorithm

The playfair cipher operates on pairs of letters. The cipher text is broken into group of blocks, each block contains two letters. Encryption and decryption cipher depends on key search, which is a square matrix that contains 5x5 letters. The matrix contains every letter expect letter j. In this paper the cryptanalyst a playfair is presented using search techniques. It is a Memetic Algorithm, a...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: BMC Bioinformatics

سال: 2018

ISSN: 1471-2105

DOI: 10.1186/s12859-017-2005-1